Approximating and Intersecting Surfaces from Points
نویسندگان
چکیده
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We present a surface approximation that is motivated by an efficient iterative ray intersection computation. On each point on a ray, a local normal direction is estimated as the direction of smallest weighted co-variances of the points. The normal direction is used to build a local polynomial approximation to the surface, which is then intersected with the ray. The distance to the polynomials essentially defines a distance field, whose zero-set is computed by repeated ray intersection. Requiring the distance field to be smooth leads to an intuitive and natural sampling criterion, namely, that normals derived from the weighted co-variances are well defined in a tubular neighborhood of the surface. For certain, well-chosen weight functions we can show that well-sampled surfaces lead to smooth distance fields with non-zero gradients and, thus, the surface is a continuously differentiable manifold. We detail spatial data structures and efficient algorithms to compute ray-surface intersections for fast ray casting and ray tracing of the surface.
منابع مشابه
A new approach for assessing stability of rock slopes considering centroids of weak zones
The intersection lines between discontinuity surfaces and their intersection points on the visible surfaces of any engineering structure may be the instability indicators. This paper describes a new approach to modelling the intersecting lines and points that would provide the first evaluation of any instability in an engineering structure characterized by the failure modes. In this work, the i...
متن کاملSurfaces Intersection for Solids Algebra: a Classiication Algorithm
Detecting intersecting surfaces and computing their intersection curves is one of the fundamental problems in solid modeling algebra. This paper introduces a new strategy to classify surfaces against their intersection status, where exact geometric entities are replaced by fuzzy geometric ones. Intersecting surfaces are thus replaced by fuzzy intersecting faces and a fuzzy intersection algorith...
متن کاملSurface/surface Intersections: a Three States Classification
Detecting intersecting surfaces and computing their intersection curves is one of the fundamental problems in solid modeling algebra. In this paper, we introduce a new strategy to classify surfaces against their intersection status. We replace exact geometric entities by fuzzy geometric ones. Intersecting surfaces are then replaced by fuzzy intersecting faces and their fuzzy intersection algori...
متن کاملOn Approximating the TSP with Intersecting Neighborhoods
In the TSP with neighborhoods problem we are given a set of n regions (neighborhoods) in the plane, and seek to find a minimum length TSP tour that goes through all the regions. We give two approximation algorithms for the case when the regions are allowed to intersect: We give the first O(1)-factor approximation algorithm for intersecting convex fat objects of comparable diameters where we are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003